On Fixed-Path Rationing Methods

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Fixed-Path Rationing Methods

Moulin (1999) characterizes the fixed-path rationing methods by efficiency, strategyproofness, consistency, and resource-monotonicity. In this note, we give a straightforward proof of his result.

متن کامل

On probabilistic rationing methods

Rationing occurs if the demand for a certain good exceeds its supply. In such situations a rationing method has to be specified in order to determine the allocation of the scarce good to the agents. Moulin (1999) introduced the notion of probabilistic rationing methods for the discrete framework. In this paper we establish a link between classical and probabilistic rationing methods. In particu...

متن کامل

Cooperative production under diminishing marginal returns: interpreting fixed-path methods

Fixed-path methods (FPMs) were introduced to manage situations where several individuals jointly operate a single technology (see [4]). In the production context, they consist in allocating marginal increments of output according to a proportions vector which changes along an arbitrary path. While very appealing from an incentives viewpoint under diminishing marginal returns, the asymmetry of t...

متن کامل

Implementing and Evaluating Alternative Airspace Rationing Methods

Title of Thesis: IMPLEMENTING AND EVALUATING ALTERNATIVE AIRSPACE RATIONING METHODS Degree candidate: Jason Matthew Burke Degree and year: Master of Science, 2002 Thesis directed by: Professor Michael O. Ball Institute for Systems Research While airport congestion has long been viewed as a major air traffic management problem in the United States, congestion in the en route airspace is drawing ...

متن کامل

Fixed-Charge Transportation on a Path: Linear Programming Formulations

The fixed-charge transportation problem is a fixed-charge network flow problem on a bipartite graph. This problem appears as a subproblem in many hard transportation problems, and is also both a special case and a strong relaxation of the challenging bigbucket multi-item lot-sizing problem. In this paper, we provide a polyhedral analysis of the polynomially solvable special case in which the as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Economic Theory

سال: 2002

ISSN: 0022-0531

DOI: 10.1006/jeth.2002.2943